人造地球卫星运动方程的代数动力学算法数值解

代数动力学算法首次被用于求人造地球卫星运动方程的数值解，在四阶算法下，与Runge-Kutta算法和辛算法的计算结果作了比较.结果表明，代数动力学算法对于人造地球卫星长期轨道的计算有较高的精度.并讨论了地球四极和八极带谐项对卫星轨道的影响. 关键词： 人造地球卫星运动方程 代数动力学算法数值解 地球四极和八极带谐项对卫星轨道的影响     

基于彩色扫描仪的图像光谱重构

针对彩色扫描仪的特点,采用主元分析法(PCA)和反向传播(BP)人工神经网络(ANN)相结合的方法对图像光谱重构进行研究。选择IT8.7/2标准色卡作为训练样本,将该色卡中的另一组色靶作为检验样本以讨论不同网络结构以及不同主元数和训练样本数对光谱重构的影响,再以自然色系统(NCS)色卡为检验样本来分析不同种类的训练和检验样本与光谱重构性能的关系。实验结果表明,采用3-14-6网络结构和6个主元数是最佳选择,训练样本和扫描目标之间的一致性是基于彩色扫描仪图像光谱重构的关键所在。     

Misalignment Fault Prediction of Wind Turbines Based on Improved Artificial Fish Swarm Algorithm

A misalignment fault is a kind of potential fault in double-fed wind turbines. The reasonable and effective fault prediction models are used to predict its development trend before serious faults occur, which can take measures to repair in advance and reduce human and material losses. In this paper, the Least Squares Support Vector Machine optimized by the Improved Artificial Fish Swarm Algorithm is used to predict the misalignment index of the experiment platform. The mixed features of time domain, frequency domain, and time-frequency domain indexes of vibration or stator current signals are the inputs of the Least Squares Support Vector Machine. The kurtosis of the same signals is the output of the model, and the 3σ principle of the normal distribution is adopted to set the warning line of misalignment fault. Compared with other optimization algorithms, the experimental results show that the proposed prediction model can predict the development trend of the misalignment index with the least prediction error.     

打水漂与物理学规律

打水漂是人类最古老的游戏之一.通过对打水漂进行简化定量分析得出,石块弹跳,只有在抛掷的初速度超过某个临界值时才会发生,并且给出了石块的最大弹跳次数.     

Some fractal properties of the percolating backbone in two dimensions

A new algorithm is presented, based on elements of artificial intelligence theory, to determine the fractal properties of the backbone of the incipient infinite cluster. It is found that the fractal dimensionality of the backbone isd _f ^BB =1.61±0.01, the chemical dimensionality isd _t=1.40±0.01, and the fractal dimension of the minimum pathd _min=1.15 ± 0.02 for the two-dimensional triangular lattice.     

不需加人工变量的两阶段法

A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear programming. Compared with the traditional two-phase method, it has advantages of saving the memories and reducing the computational efforts.     

GA-BP嵌套算法的理论及应用

分析了BP算法、遗传算法以及GA-BP-APARTING算法的特点,提出了GA-BP-NESTING算法.在人工神经网络的在线学习和离线学习方式下,分别对BP算法、GA算法、GA-BP-APARTING算法和GA-BP-NESTING算法进行了比较研究,研究发现:第一,网络初始权值的赋值对人工神经网络训练影响很大;第二,离线学习方式下GA-BP-NESTING算法效果最佳.